Abstraction in Inductive Theorem Proving by Analogy
نویسنده
چکیده
ion in Inductive Theorem Proving by Analogy Erica Melis Universit at des Saarlandes, Fachbereich Informatik, D-66041 Saarbr ucken, Germany, [email protected] Abstract The abstraction described in this paper has been utilized to restrict the retrieval of source plans, to choose appropriate analogical mappings, and to trigger reformulations in the system ABALONE. The key idea is that abstraction is used at a meta-level. Unlike most previous attempts using abstraction for analogical reasoning, our approach transfers the ground-level source proof plan of a ground-level problem rather than using the abstract solution of an abstracted source problem as a guide for the ground level solution.
منابع مشابه
External Analogy in Inductive Theorem Proving
This paper investigates analogy-driven proof plan construction in inductive theorem proving. Given a proof plan of a source theorem, we identify constraints of second-order mappings that enable a replay of the source plan to produce a similar plan for the target theorem. In addition, the analogical replay is controlled by justiications that have to be satissed in the target. Our analogy procedu...
متن کاملInternal Analogy in Theorem Proving
Internal analogy tries to reuse solutions of subproblems within the same problem solving process. In mathematical theorem proving several patterns are known where internal analogy suggests itself. Hence, we propose the use of internal analogy in automated theorem proving. This paper investigates the possibility of incorporating internal analogy into the inductive proof planner CL A M. It introd...
متن کاملSaturation-Based Theorem Proving: Past Successes and Future Potential (Abstract)
A resolution theorem prover for intuitionistic logic p. 2 Proof-terms for classical and intuitionistic resolution p. 17 Proof-search in intuitionistic logic with equality, or back to simultaneous rigid E-Unification p. 32 Extensions to a generalization critic for inductive proof p. 47 Learning domain knowledge to improve theorem proving p. 62 Patching faulty conjectures p. 77 Internal analogy i...
متن کاملThe Refined Calculus of Inductive Construction: Parametricity and Abstraction
We present a refinement of the Calculus of Inductive Constructions in which one can easily define a notion of relational parametricity. It provides a new way to automate proofs in an interactive theorem prover like Coq.
متن کاملA Model of Analogy-Driven Proof-Plan Construction
This paper addresses a model of analogy-driven theorem proving that is more general and cognitively more adequate than previous approaches. The model works at the level of proof-plans. More precisely, we consider analogy as a control strategy in proof planning that employs a source proof-plan to guide the construction of a proof-plan for the target problem. Our approach includes a reformulation...
متن کامل